#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
using namespace std;
int main()
{
    /*class Solution {
    public:
        string longestPalindrome(string s) {
            if (s.empty())
                return "";

            int left = 0, right = 0;

            for (int i = 0; i < s.length(); ++i) {

                int len1 = 0, l = i, r = i;
                while (l >= 0 && r < s.length() && s[l] == s[r]) {
                    --l;
                    ++r;
                    len1++;
                }

                int len2 = 0;
                l = i;
                r = i + 1;
                while (l >= 0 && r < s.length() && s[l] == s[r]) {
                    --l;
                    ++r;
                    len2++;
                }

                int len = max(len1 * 2 - 1, len2 * 2);

                if (len > right - left) {
                    left = i - (len - 1) / 2;
                    right = i + len / 2;
                }
            }

            return s.substr(left, right - left + 1);
        }
    };*/

    cout << 1;


	return 0;
}